The dimension of semialgebraic subdifferential graphs
نویسندگان
چکیده
A corollary of a celebrated theorem of Minty is that the subdifferential graph of a closed convex function on Rn has uniform local dimension n. In contrast, there exist nonconvex closed functions whose subdifferentials have large graphs. We consider how far Minty’s corollary extends to functions that are nonconvex but semi-algebraic. © 2011 Elsevier Ltd. All rights reserved.
منابع مشابه
Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions
Using a geometric argument, we show that under a reasonable continuity condition, the Clarke subdifferential of a semi-algebraic (or more generally stratifiable) directionally Lipschitzian function admits a simple form: the normal cone to the domain and limits of gradients generate the entire Clarke subdifferential. The characterization formula we obtain unifies various apparently disparate res...
متن کاملTameness of Holomorphic Closure Dimension in a Semialgebraic Set
Given a semianalytic set S in Cn and a point p ∈ S, there is a unique smallest complex-analytic germ Xp which contains Sp, called the holomorphic closure of Sp. We show that if S is semialgebraic then Xp is a Nash germ, for every p, and S admits a semialgebraic filtration by the holomorphic closure dimension. As a consequence, every semialgebraic subset of a complex vector space admits a semial...
متن کاملParametrization of Semialgebraic Sets Imacs Symposium Sc{1993
In this paper we consider the problem of the algorithmic parametrization of a d-dimensional semialgebraic subset S of I R n (n > d) by a semialgebraic and continuous mapping from a subset of I R d. Using the Cylindrical Algebraic Decomposition algorithm we easily obtain semialgebraic, bijective parametrizations of any given semialgebraic set, but in this way some topological properties of S (su...
متن کاملPartial second-order subdifferentials of -prox-regular functions
Although prox-regular functions in general are nonconvex, they possess properties that one would expect to find in convex or lowerC2 functions. The class of prox-regular functions covers all convex functions, lower C2 functions and strongly amenable functions. At first, these functions have been identified in finite dimension using proximal subdifferential. Then, the definition of prox-regula...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کامل